A Review of Sequential Supervised Learning
نویسنده
چکیده
Sequential supervised learning problems arise in many applications. After a definition of this learning task, we give out a set of evaluation criteria to the sequential supervised learning algorithms, some leading ones of which are described in this paper and evaluated based on the given criteria. In this paper, we show how these sequential supervised learning algorithms evolve from one to another based on the analysis of their limitations and advantages. We also try to give some intuitions to design novel sequential learning algorithms by showing how the existing ones are motivated by the corresponding traditional supervised learning algorithms. Some open problems in this area are discussed at the end.
منابع مشابه
Semi-Supervised Learning Based Prediction of Musculoskeletal Disorder Risk
This study explores a semi-supervised classification approach using random forest as a base classifier to classify the low-back disorders (LBDs) risk associated with the industrial jobs. Semi-supervised classification approach uses unlabeled data together with the small number of labelled data to create a better classifier. The results obtained by the proposed approach are compared with those o...
متن کاملA Comparative Evaluation of Sequential Feature Selection Algorithms
Several recent machine learning publications demonstrate the utility of using feature selection algorithms in supervised learning tasks. Among these, sequential feature selection algorithms are receiving attention. The most frequently studied variants of these algorithms are forward and backward sequential selection. Many studies on supervised learning with sequential feature selection report a...
متن کاملMulti-view Discriminative Sequential Learning
Discriminative learning techniques for sequential data have proven to be more effective than generative models for named entity recognition, information extraction, and other tasks of discrimination. However, semi-supervised learning mechanisms that utilize inexpensive unlabeled sequences in addition to few labeled sequences – such as the Baum-Welch algorithm – are available only for generative...
متن کاملA Learning Theory Framework for Association Rules and Sequential Events A Learning Theory Framework for Association Rules and Sequential Events
We present a framework and generalization analysis for the use of association rules in the setting of supervised learning. We are specifically interested in a sequential event prediction problem where data are revealed one by one, and the goal is to determine what will next be revealed. In the context of this problem, algorithms based on association rules have a distinct advantage over classica...
متن کاملOnline learning via sequential complexities
We consider the problem of sequential prediction and provide tools to study the minimax value of the associated game. Classical statistical learning theory provides several useful complexity measures to study learning with i.i.d. data. Our proposed sequential complexities can be seen as extensions of these measures to the sequential setting. The developed theory is shown to yield precise learni...
متن کامل